Prefetch R-tree: A Disk and Cache Optimized Multidimensional Index Structure
نویسندگان
چکیده
منابع مشابه
A new prefetch cache scheme
The criterion that existing prefetch schemes apply in prefetching documents from the origin servers into a proxy Web server is usually the probability of each document being accessed in the near future or the popularity of the document. This criterion is not optimum in minimizing the average access latency or maximizing the average hit probability because the factors that affect on the latency ...
متن کاملLazy-Adaptive Tree: An Optimized Index Structure for Flash Devices
Flash memories are in ubiquitous use for storage on sensor nodes, mobile devices, and enterprise servers. However, they present significant challenges in designing tree indexes due to their fundamentally different read and write characteristics in comparison to magnetic disks. In this paper, we present the Lazy-Adaptive Tree (LATree), a novel index structure that is designed to improve performa...
متن کاملR-tree Index Optimization
The optimization of spatial indexing is an increasingly important issue considering the fact that spatial databases, in such d i v erse areas as geographical, CAD/CAM and image applications, are growing rapidly in size and often contain on the order of millions of items or more. This necessitates the storage of the index on disk, which has the potential of slowing down the access time signiican...
متن کاملND-Tree: Multidimensional Indexing Structure
The importance of multimedia databases has been growing over the last years in the most diverse areas of application, such as: Medicine, Geography, etc. With the growth of importance and of use, including the explosive increase of multimedia data on the Internet, comes the larger dimensions of these databases. This evolution creates the need for more efficient indexing structures in a way that ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2006
ISSN: 1598-2866
DOI: 10.3745/kipstd.2006.13d.4.463